A Formalized Theory for Verifying Stability and Convergence of Automata in PVS
نویسندگان
چکیده
Correctness of many hybrid and distributed systems require stability and convergence guarantees. Unlike the standard induction principle for verifying invariance, a theory for verifying stability or convergence of automata is currently not available. In this paper, we formalize one such theory proposed by Tsitsiklis [25]. We build on the existing PVS metatheory for untimed, timed, and hybrid input/output automata, and incorporate the concepts about fairness, stability, Lyapunov-like functions, and convergence. The resulting theory provides two sets of sufficient conditions, which when instantiated and verified for particular automata, guarantee convergence and stability, respectively.
منابع مشابه
Verifying a Secure Information Flow Analyzer
Denotational semantics for a substantial fragment of Java is formalized by deep embedding in PVS, making extensive use of dependent types. A static analyzer for secure information flow for this language is proved correct, that is, it enforces noninterference.
متن کاملConvergence Verification: From Shared Memory to Partially Synchronous Systems
Verification of partially synchronous distributed systems is difficult because of inherent concurrency and the potentially large state space of the channels. This paper identifies a subclass of such systems for which convergence properties can be verified based on the proof of convergence for the corresponding discrete-time shared state system. The proof technique extends to a class of partiall...
متن کاملTowards Verified Distributed Software Through Refinement of Formal Archetypes
This paper discusses experiments with a “model-based” approach for developing verified distributed systems in which program development is carried out by stepwise refinement: we encode, specifications and algorithm archetypes in the PVS theorem prover, carry out stepwise refinement and concomitant proofs, and obtain collections of verified algorithms encoded in PVS. Finally we transform algorit...
متن کاملAssertion-Based Analysis of Hybrid Systems with PVS
Hybrid automata are a well-established mathematical model for discrete systems acting in a continuous environment. We present assertion-based proof methods for hybrid systems for inductive assertional proofs. The model and the proof-methods are rigorously formalized within the PVS theorem-prover. We validate the applicability of the approach on a number of examples.
متن کاملFormalizing Type Theory in PVS: a case study
In this case study we investigate the use of PVS for developing type theoretical concepts and verifying the correctness of a typing algorithm. PVS turns out to be very useful for efficient development of a sound basic theory about polymorphic typing. This research contributes to the PoplMark challenge on mechanizing metatheory. The correctness of the typing algorithm is expressed as the so-call...
متن کامل